Simple R-Tree for Temporal Searches
نویسندگان
چکیده
The R-Tree and variant indexes have been used for multidimensional indexing since 1984 and applied to temporal data since 1994. Despite this, there are few functional implementations of the index that can be applied directly to the temporal data. This paper explores the use of the index for temporal subsequence searches and identifies two implications that must be considered so the index can be used in the temporal domain. We empirically evaluate the requirements for equi-node splits. The tree performs well and is comparable to other methods eliminating approximately 86% of search space.
منابع مشابه
A method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملIndexing Large Trajectory Data Sets With SETI
With the rapid increase in the use of inexpensive, location-aware sensors in a variety of new applications, large amounts of time-sequenced location data will soon be accumulated. Efficient indexing techniques for managing these large volumes of trajectory data sets are urgently needed. The key requirements for a good trajectory indexing technique is that it must support both searches and inser...
متن کاملImproving the Performance of ICA Algorithm for fMRI Simulated Data Analysis Using Temporal and Spatial Filters in the Preprocessing Phase
Introduction: The accuracy of analyzing Functional MRI (fMRI) data is usually decreases in the presence of noise and artifact sources. A common solution in for analyzing fMRI data having high noise is to use suitable preprocessing methods with the aim of data denoising. Some effects of preprocessing methods on the parametric methods such as general linear model (GLM) have previously been evalua...
متن کاملEfficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully scanned. Given the large data volumes created by the ever increasing time dimension, sequential scanning is prohibitive. This is especially true when the temporal join involves only parts of the joining relations (e.g...
متن کاملKalman-Tree: an Index Structure on Spatio-Temporal Data
In the research area of spatio-temporal databases, we need to answer the queries like ”select the objects which will be in a specific area at a future time” quickly and accurately. Solutions to this question include two aspects: a mathematic model to predict future location with adequate accuracy and an index structure that can retrieve the qualified objects quickly. Currently, the proposed fut...
متن کامل